The irredundance number and maximum degree of a graphBOLLOBAS, B; COCKAYNE, E. J.Discrete mathematics. 1984, Vol 49, Num 2, pp 197-199, issn 0012-365XArticle

Degree and local connectivity in diagraphsMADER, W.Combinatorica (Print). 1985, Vol 5, Num 2, pp 161-165, issn 0209-9683Article

Box-threshold graphsPELED, U. N; SIMEONE, B.Journal of graph theory. 1984, Vol 8, Num 2, pp 331-345, issn 0364-9024Article

Monotonicity of the order of (D; g)-cagesBALBUENA, C; MARCOTE, X.Applied mathematics letters. 2011, Vol 24, Num 11, pp 1933-1937, issn 0893-9659, 5 p.Article

Independence, clique size and maximum degreeFAJTLOWICZ, S.Combinatorica (Print). 1984, Vol 4, Num 1, pp 35-38, issn 0209-9683Article

Distance degree regular graphsHILANO, T; NOMURA, K.Journal of combinatorial theory. Series B. 1984, Vol 37, Num 1, pp 96-100, issn 0095-8956Article

On the existence of a specified cycle in digraphs with constraints on degreesABDELHAMID BENHOCINE.Journal of graph theory. 1984, Vol 8, Num 1, pp 101-107, issn 0364-9024Article

Cubic graphs with 62 vertices having the same path layer matrixDOBRYNIN, A. A.Journal of graph theory. 1993, Vol 17, Num 1, pp 1-4, issn 0364-9024Article

GRAPHS WITH PRESCRIBED SIZE AND VERTEX PARITIES.PRATT PJ; VANDERJAGT DW.1977; COLLOQ. MATH.; POLOGNE; DA. 1977; VOL. 38; NO 1; PP. 147-151; BIBL. 4 REF.Article

THE DISTRIBUTION OF DEGREES IN A LARGE RANDOM TREE.ROBINSON RW; SCHWENK AJ.1975; DISCRETE MATH.; NETHERL.; DA. 1975; VOL. 12; NO 4; PP. 359-372; BIBL. 8 REF.Article

GRAPHS WITH PRESCRIBED DEGREE SETS AND GIRTHCHARTRAND G; GOULD RJ; KAPOOR SF et al.1981; PERIOD. MATH. HUNG.; ISSN 0031-5303; HUN; DA. 1981; VOL. 12; NO 4; PP. 261-266; BIBL. 2 REF.Article

A SURVEY OF THE THEORY OF POTENTIALLY P-GRAPHIC AND FORCIBLY P-GRAPHIC DEGREE SEQUENCESRAO SB.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 417-440; BIBL. 10 P.Conference Paper

THE ORDERS OF GRAPHS WITH PRESCRIBED DEGREE SETSSIPKA TA.1980; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1980; VOL. 4; NO 3; PP. 301-307; BIBL. 2 REF.Article

DEGRES ET NOMBRE DE STABILITE D'UN GRAPHE.HANSEN P.1975; CAH. CENTRE ET. RECH. OPERAT.; BELG.; DA. 1975; VOL. 17; NO 2-4; PP. 213-220; BIBL. 2 REF.; (COLLOQ. THEOR. GRAPHES; PARIS; 1974)Conference Paper

ON THE CONNECTION BETWEEN CHROMATIC NUMBER MAXIMAL CLIQUE AND MINIMAL DEGREE OF A GRAPH.ANDRASFAI B; ERDOS P; SOS VT et al.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 8; NO 3; PP. 205-218; BIBL. 5 REF.Article

THRESHOLD SEQUENCESHAMMER PL; IBARAKI T; SIMEONE B et al.1981; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1981; VOL. 2; NO 1; PP. 39-49; BIBL. 19 REF.Article

(D; N)-CAGESDOWNS MM; GOULD RJ; MITCHEM J et al.1981; SOUTHEASTERN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND COMPUTING. 12/1981/LOUISIANA STATE UNIVERSITY LA; CAN; WINNIPEG: UTILITAS MATHEMATICA PUBLISHING; DA. 1981; PP. 279-293; BIBL. 5 REF.Conference Paper

DEGREE SETS FOR TRIANGLE-FREE GRAPHSKAPOOR SF; LESNIAK FOSTER L.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 320-330; BIBL. 4 REF.Conference Paper

DEGREE SEQUENCES OF CACTIRAMACHANDRA RAO A.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 410-416; BIBL. 2 REF.Conference Paper

GRAPHS WHOSE EVERY INDEPENDENT SET HAS A COMMON NEIGHBOURPACH J.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 37; NO 2-3; PP. 217-228; BIBL. 7 REF.Article

SIMPLE AND MULTIGRAPHIC REALIZATIONS OF DEGREE SEQUENCESEGGLETON RB; HOLTON DA.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 884; PP. 155-172; BIBL. 11 REF.Conference Paper

ON THE EXISTENCE OF GRAPHS WITH PRESCRIBED DEGREES AND CONNECTIVITY.HAKIMI SL.1974; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1974; VOL. 26; NO 1; PP. 154-164; BIBL. 11 REF.Article

On independent generalized degrees and independence numbers in K(1,m)-free graphsFAUDREE, R. J; GOULD, R. J; JACBSON, M. S et al.Discrete mathematics. 1992, Vol 103, Num 1, pp 17-24, issn 0012-365XArticle

Page / 25